Verification in loosely synchronous queue-connected discrete timed automata
نویسندگان
چکیده
منابع مشابه
Verification in loosely synchronous queue-connected discrete timed automata
We look at a model of a queue system that consists of the following components: 1. Two discrete timed automata W (the “writer”) and R (“the reader”). 2. One unrestricted queue that can be used to send messages from W to R. There is no bound on the length of the queue. W and R do not share a global clock and operate in a loosely synchronous way. That is, the absolute value of the difference betw...
متن کاملAutomatic Verification of Multi-queue Discrete Timed Automata
We propose a new infinite-state model, called the Multi-queue Discrete Timed Automaton MQDTA, which extends Timed Automata with queues, but only has integer-valued clocks. Due to careful restrictions on queue usage, the binary reachability (the set of all pairs of configurations ( of an MQDTA such that can reach through zero or more transitions) is effectively semilinear. We then prove the deci...
متن کاملGeneralized Discrete Timed Automata: Decidable Approximations for Safety Verification
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the r-reset-bounded approximation, the B-bounded approximation, and the hB; ricrossing-bounded approximation), and derive automata-theoretic characterizations of the binary re...
متن کاملVerification for Timed Automata Extended with Unbounded Discrete Data Structures
We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack. In this way, we obtain a strong model that may for instance be used to model real-time programs with procedure calls. It is long known that the reachability problem for this model is decidable. The goal of this paper i...
متن کاملVerification of Scalable Synchronous Queue
Lock-free algorithms are extremely hard to be built correct due to their fine-grained concurrency natures. Formal techniques for verifying them are crucial. We present a framework for verification of CAS-based lock-free algorithms, and prove a nontrivial lock-free algorithm Scalable Synchronous Queue that is practically adopted in Java 6. The strength of our approach lies on that it relieves th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00076-2